Quantum solvability of noisy linear problems by divide-and-conquer strategy

A Divide-and-Conquer Strategy for Parsing

In this paper, we propose a novel strategy which is designed to enhance the accuracy of the parser by simplifying complex sentences before parsing. This approach involves the separate parsing of the constituent sub-sentences within a complex sentence. To achieve that, the divide-and-conquer strategy first disam-biguates the roles of the link words in the sentence and segments the sentence based...

Divide and conquer: Rethinking IT strategy

Web exclusive, August 2006 IT executives know that the right investments in technology can deliver a significant competitive advantage. Over the past 50 years, companies such as American Airlines, Apple Computer, Frito-Lay, Google, and Wal-Mart Stores have changed the competitive rules in their respective sectors by introducing technology-enabled innovations. But at many companies today, CIOs a...

Asymptotics of linear divide-and-conquer recurrences

Asymptotics of divide-and-conquer recurrences is usually dealt either with elementary inequalities or with sophisticated methods coming from analytic number theory. Philippe Dumas proposes a new approach based on linear algebra. The example of the complexity of Karatsuba’s algorithm is used as a guide in this summary. The complexity analysis of divide-and-conquer algorithms gives rise to recurr...

Divide and Conquer for Linear Expected Time

1 Divide and Conquer : Noisy Communication in Networks

In a society composed of a ruler and its citizens: What are the determinants of the political equilibrium between these two? This paper approaches this problem as a game played between a ruler who has to decide the distribution of the aggregate income and a group of agents/citizens who have the opportunity to revolt if they are unhappy with the distribution. Nevertheless, if too few revolt, the...